因特网上基于对等网络的服务网格平台构建

提出与描述了适合大规模因特网环境的对等网络服务网格平台PSGP(P2P-based Service Grid Platform)的设计、实现与性能评测.PSGP平台结合了对等网络技术、网格的Web Services技术、面向服务的框架技术,使得PSGP平台具有非集中性、可扩展性、互操作性与鲁棒性好的优点.使用对等网络的JXTA协议完成对等实体的组织、资源发现、服务调用的功能.通过设置对等实体的衔级、安全的认证机制等高级技术保证了平台的安全性与可信任机制.并行应用的案例测试表明,PSGP在对等实体的通信轮回时间、应用的吞吐量上,具有较好的性能,可以作为实现大规模的分布式模拟的可行方案.     

Communication-efficient and crash-quiescent Omega with unknown membership

The failure detector class Omega (Ω) provides an eventual leader election functionality, i.e., eventually all correct processes permanently trust the same correct process. An algorithm is communication-efficient if the number of links that carry messages forever is bounded by n, being n the number of processes in the system. It has been defined that an algorithm is crash-quiescent if it eventually stops sending messages to crashed processes. In this regard, it has been recently shown the impossibility of implementing Ω crash quiescently without a majority of correct processes. We say that the membership is unknown if each process pi only knows its own identity and the number of processes in the system (that is, i and n), but pi does not know the identity of the rest of processes of the system. There is a type of link (denoted by ADD link) in which a bounded (but unknown) number of consecutive messages can be delayed or lost.In this work we present the first implementation (to our knowledge) of Ω in partially synchronous systems with ADD links and with unknown membership. Furthermore, it is the first implementation of Ω that combines two very interesting properties: communication-efficiency and crash-quiescence when the majority of processes are correct. Finally, we also obtain with the same algorithm a failure detector () such that every correct process eventually and permanently outputs the set of all correct processes.     

Repeated detection of conjunctive predicates in distributed executions

Given a conjunctive predicate ? over a distributed execution, this paper gives an algorithm to detect all interval sets, each interval set containing one interval per process, in which the local values satisfy the Definitely(?) modality. The time complexity of the algorithm is O(n³p), where n is the number of processes and p is the bound on the number of times a local predicate becomes true at any process. The paper also proves that unlike the Possibly(?) modality which admits O(pn) solution interval sets, the Definitely(?) modality admits O(np) solution interval sets. The paper also gives an on-line test to determine whether all solution interval sets can be detected in polynomial time under arbitrary fine-grained causality-based modality specifications.     

Soft sets and soft rough sets

In this study, we establish an interesting connection between two mathematical approaches to vagueness: rough sets and soft sets. Soft set theory is utilized, for the first time, to generalize Pawlak’s rough set model. Based on the novel granulation structures called soft approximation spaces, soft rough approximations and soft rough sets are introduced. Basic properties of soft rough approximations are presented and supported by some illustrative examples. We also define new types of soft sets such as full soft sets, intersection complete soft sets and partition soft sets. The notion of soft rough equal relations is proposed and related properties are examined. We also show that Pawlak’s rough set model can be viewed as a special case of the soft rough sets, and these two notions will coincide provided that the underlying soft set in the soft approximation space is a partition soft set. Moreover, an example containing a comparative analysis between rough sets and soft rough sets is given.     

基于Hadoop的云存储的研究及实现

首先描述了云计算、云存储的概念、云计算的体系结构及云存储的架构模式;然后介绍了Hadoop工作原理及其文件存储的方法;最后基于eyeOS的Web操作系统,对传统的文件存储方法进行改进,采用Hadoop的HDFS技术实现文件的分布式存储及容错控制。     

基于云计算的在线学习平台的设计与应用

本文将云计算的概念引入到在线学习平台的建设中,提出设计基于云计算的在线学习平台。首先介绍云计算的概念和特点,然后提出一种基于云计算在线学习平台的设计框架,最后实现了一个在线讨论的云计算教育服务平台。     

云计算及其关键技术研究

在分析现有定义的基础上对云计算提出了较全面的参考性定义,并给出了云计算的六大特征、四种部署模式和三种服务模式.此外,通过对云环境中三种角色的责任分析和对主流云计算产品的研究,抽象出了支撑云计算的关键技术,最后指出云计算对未来软件市场发展的影响.     

基于云计算下的高校图书馆数据安全策略的探讨

云计算是继网格计算后又一项正在兴起中的技术,它的出现使"互联网上众多的计算机成为一台虚拟超级计算机"的梦想慢慢变成了现实.云计算下高校图书馆的信息安全问题,一方面来自云服务提供商提供的安全保障,另一方面来自高校图书馆的信息安全需求.针对高校图书馆可能面临的安全存储、访问控制、权限管理、数据保密及知识权等信息安全问题,云...     

Windows可信计算实现研究

描述Windows的可信计算实现架构—NGSCB;应用可信计算理论分析NGSCB的主要特性,剖析具有完整性度量、可信启动、TPM支撑架构的理论基础和主要实现方法;列举NGSCB现有可信计算产品存在的问题,指出NGSCB的发展前景和需要努力的方向。     

东营云计算系统架构关键技术的研究

云计算是一种新的用户体验和业务模式,它是在分布式计算的基础上发展而来的,黄河三角洲云计算中心是东营创建智慧城市的积极尝试。介绍云计算的概念、特点和云计算的系统架构,以IBM的云计算技术为例,结合黄河三角洲云计算中心,研究云平台系统架构的关键技术,指出了云计算的发展趋势。